The Complexity of the Equivalence and Equation Solvability Problems over Meta-abelian Groups
نویسنده
چکیده
We provide polynomial time algorithms for deciding equation solvability and identity checking over groups that are semidirect products of two nite Abelian groups. Our main method is to reduce these problems to the sigma equation solvability and sigma equivalence problems over modules for commutative unital rings.
منابع مشابه
The extended equivalence and equation solvability problems for groups
The algorithmic aspects of the equivalence problem and the equation solvability problem have received increasing attention in the past two decades. The equivalence problem for a finite algebra A asks whether or not two (term or polynomial) expressions s and t are equivalent over A (denoted by A |= s ≈ t), i.e. if s and t determine the same function over A. The equation solvability is one of the...
متن کاملDefinability of linear equation systems over groups and rings
Motivated by the quest for a logic for PTIME and recent insights that the descriptive complexity of problems from linear algebra is a crucial aspect of this problem, we study the solvability of linear equation systems over finite groups and rings from the viewpoint of logical (inter-)definability. All problems that we consider are decidable in polynomial time, but not expressible in fixedpoint ...
متن کاملThe non-abelian tensor product of normal crossed submodules of groups
In this article, the notions of non-abelian tensor and exterior products of two normal crossed submodules of a given crossed module of groups are introduced and some of their basic properties are established. In particular, we investigate some common properties between normal crossed modules and their tensor products, and present some bounds on the nilpotency class and solvability length of the...
متن کاملThe graph of equivalence classes and Isoclinism of groups
Let $G$ be a non-abelian group and let $Gamma(G)$ be the non-commuting graph of $G$. In this paper we define an equivalence relation $sim$ on the set of $V(Gamma(G))=Gsetminus Z(G)$ by taking $xsim y$ if and only if $N(x)=N(y)$, where $ N(x)={uin G | x textrm{ and } u textrm{ are adjacent in }Gamma(G)}$ is the open neighborhood of $x$ in $Gamma(G)$. We introduce a new graph determined ...
متن کاملFuzzy Subgroups of Rank Two Abelian p-Group
In this paper we enumerate fuzzy subgroups, up to a natural equivalence, of some finite abelian p-groups of rank two where p is any prime number. After obtaining the number of maximal chains of subgroups, we count fuzzy subgroups using inductive arguments. The number of such fuzzy subgroups forms a polynomial in p with pleasing combinatorial coefficients. By exploiting the order, we label the s...
متن کامل